On Two Conjectures About Set-graceful Graphs
نویسندگان
چکیده
منابع مشابه
On Two Conjectures on Packing of Graphs
In 1978, Bollobás and Eldridge [5] made the following two conjectures. (C1) There exists an absolute constant c > 0 such that, if k is a positive integer and G1 and G2 are graphs of order n such that ∆(G1),∆(G2) n− k and e(G1), e(G2) ckn, then the graphs G1 and G2 pack. (C2) For all 0 < α < 1/2 and 0 < c < √ 1/8, there exists an n0 = n0(α, c) such that, if G1 and G2 are graphs of order n > n0 s...
متن کاملTopological Integer Additive Set-Graceful Graphs
Let N0 denote the set of all non-negative integers and X be any subset of X. Also denote the power set of X by P(X). An integer additive set-labeling (IASL) of a graph G is an injective function f : V (G) ! P(X) such that the induced function f+ : E(G) ! P(X) is defined by f+(uv) = f(u) + f(v), where f(u) + f(v) is the sumset of f(u) and f(v). An IASL f is said to be a topological IASL (Top-IAS...
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کاملConfirming Two Conjectures About the Integer Partitions
For a given integer n, let 4n denote the set of all integer partitions *1 *2 } } } *m>0 (m 1), of n. For the dominance order ``P'' on 4n , we show that if two partitions *, + are both chosen from 4n uniformly at random, and independent of each other, then Pr(*P+) 0 as n . This statement answers affirmatively a question posed by Macdonald in 1979. The proof is based on the limit joint distributi...
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1989
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(89)80047-2